THREE-SPACE PROBLEM FOR SOME APPROXIMATION PROPERTIES

نویسندگان

چکیده

منابع مشابه

Three-space-problem for some classes of linear topological spaces

We examine the so-called three-space-stability for some classes of linear topological and locally convex spaces for which this problem has not been investigated.

متن کامل

Viscosity approximation methods for W-mappings in Hilbert space

We suggest a explicit viscosity iterative algorithm for nding a common elementof the set of common xed points for W-mappings which solves somevariational inequality. Also, we prove a strong convergence theorem with somecontrol conditions. Finally, we apply our results to solve the equilibrium problems.Finally, examples and numerical results are also given.

متن کامل

An Approximation Method for Fuzzy Fixed-Charge Transportation Problem

In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy ...

متن کامل

On Some Approximation Algorithms for the Set Partition Problem

We study the set partition problem, which is concerned with partitioning a collection of sets into P subcollections such that the maximum number of elements among all the subcollections is minimized. The problem is NP hard, even when P=2 and the cardinality of each set is 2. This special case is transferred to an edge partition problem for graphs. This paper evaluates the eeciency of diierent a...

متن کامل

On Some Approximation Algorithms for Dense Vertex Cover Problem

In this work we study the performance of some algorithms approximating the vertex cover problem (VCP) with respect to density constraints. We consider a modiication of the algorithm of Karpinski and Zelikovsky 9] for the weighted VCP and prove a performance guarantee for this algorithm in terms of a new density parameter. Also we investigate the hardness of approximation for the VCP on everywhe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Taiwanese Journal of Mathematics

سال: 2010

ISSN: 1027-5487

DOI: 10.11650/twjm/1500405738